Bayer and Eisenbud Contents

نویسنده

  • Sung Won Park
چکیده

We study a family of stable curves defined combinatorially from a trivalent graph. Most of our results are related to the conjecture of Green which relates the Clifford index of a smooth curve, an important intrinsic invariant measuring the “specialness” of the geometry of the curve, to the “resolution Clifford index,” a projective invariant defined from the canonical embedding. Thus we study the canonical linear series and its powers and identify them in terms of combinatorial data on the graph; we given combinatorial criteria for the canonical series to be base point free or very ample; we prove the analogue of Noether’s theorem on the projective normality of smooth canonical curves; we define a combinatorial invariant of a graph which we conjecture to be equal to the resolution Clifford index of the associated graph curve, at least for “most” graphs; and we prove our conjecture for planar graphs and for graphs of Clifford index 0. Along the way we prove a result of some independent interest on the canonical sheaves of (not necessarily arithmetically Cohen-Macaulay) face varieties. The Appendix establishes a formula connecting the combinatorics of a trivalent graph G and the minimal degree of an admissible covering of a curve of arithmetic genus 0 by the corresponding graph curve. :c 1991 Academic Press. Inc.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ribbons and Their Canonical Embeddings

We study double structures on the projective line and on certain other varieties, with a view to having a nice family of degenerations of curves and K3 surfaces of given genus and Cli ord index. Our main interest is in the canonical embeddings of these objects, with a view toward Green's Conjecture on the free resolutions of canonical curves. We give the canonical embeddings explicitly, and exh...

متن کامل

E. Ballico∗ GRAPH CURVES WITH GONALITY ONE

A graph curve is a nodal curve C such that each irreducible component of C is smooth, rational and meets exactly 3 others (Bayer and Eisenbud). Here we classify the graph curves with gonality 1 with respect to balanced line bundles in the sense of L. Caporaso.

متن کامل

Direct methods for primary decomposition

Let I be an ideal in a polynomial ring over a perfect field. We give new methods for comput ing the equidimensional parts and radical of I, for localizing I with respect to another ideal, and thus for finding the pr imary decomposit ion of / . Our methods rest on modern ideas from commutat ive algebra, and are direct in the sense that they avoid the generic projections used by Hermann (1926) an...

متن کامل

Graph Curves

Graph curves are a useful construction for considering various problems in algebraic geometry. In this paper, we explain some of the results about graph curves from the seminal paper by Bayer and Eisenbud [3]. We provide background in simplicial cohomology and the canonical series of a curve for the beginning reader. In our study of algebraic curves, it is helpful to consider degenerations – ob...

متن کامل

The minimal components of the Mayr-Meyer ideals

rifi such that each ri has degree at most deg f+(kd) n). Mayr and Meyer in [MM] found (generators) of a family of ideals for which a doubly exponential bound in n is indeed achieved. Bayer and Stillman [BS] showed that for these Mayr-Meyer ideals any minimal generating set of syzygies has elements of doubly exponential degree in n. Koh [K] modified the original ideals to obtain homogeneous quad...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991